The vector lattice cover of certain partially ordered groups
نویسندگان
چکیده
منابع مشابه
On Certain Contraction Mappings in a Partially Ordered Vector Space1
G. Birkhoff [l] and H. Samelson [4] have shown that a means of solving problems concerning the existence and uniqueness of eigenvectors of positive operators is given by introducing a suitable metric on a subset of the cone with respect to which the operators are contractions. More specifically, they have proved the Perron theorem for matrices with positive elements by intersecting the positive...
متن کاملConvex $L$-lattice subgroups in $L$-ordered groups
In this paper, we have focused to study convex $L$-subgroups of an $L$-ordered group. First, we introduce the concept of a convex $L$-subgroup and a convex $L$-lattice subgroup of an $L$-ordered group and give some examples. Then we find some properties and use them to construct convex $L$-subgroup generated by a subset $S$ of an $L$-ordered group $G$ . Also, we generalize a well known result a...
متن کاملAmalgamations of Lattice Ordered Groups
The author considers the problem of determining whether certain classes of lattice ordered groups (¿-groups) have the amalgamation property. It is shown that the classes of abelian totally ordered groups (ogroups) and abelian /-groups have the property, but that the class of ¿-groups does not. However, under certain cardinality restrictions one can find an ¿-group which is the "product" of /-gr...
متن کاملLattice-ordered reduced special groups
Special groups [M. Dickmann, F. Miraglia, Special Groups : Boolean-Theoretic Methods in the Theory of Quadratic Forms, Memoirs Amer. Math. Soc., vol. 689, Amer. Math. Soc., Providence, RI, 2000] are a first-order axiomatization of the theory of quadratic forms. In Section 2 we investigate reduced special groups (RSG) which are a lattice under their natural representation partial order (for moti...
متن کاملFree abelian lattice-ordered groups
Let n be a positive integer and FA`(n) be the free abelian latticeordered group on n generators. We prove that FA`(m) and FA`(n) do not satisfy the same first-order sentences in the language L={+,−, 0,∧,∨} if m 6= n. We also show that Th(FA`(n)) is decidable iff n ∈ {1, 2}. Finally, we apply a similar analysis and get analogous results for the free finitely generated vector lattices. A. M. S. C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
سال: 1993
ISSN: 0263-6115
DOI: 10.1017/s1446788700031839